On the best linear one-sided Chebyshev approximation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Polynomials of Best One Sided Approximation

Nutzungsbedingungen Mit dem Zugriff auf den vorliegenden Inhalt gelten die Nutzungsbedingungen als akzeptiert. Die angebotenen Dokumente stehen für nicht-kommerzielle Zwecke in Lehre, Forschung und für die private Nutzung frei zur Verfügung. Einzelne Dateien oder Ausdrucke aus diesem Angebot können zusammen mit diesen Nutzungsbedingungen und unter deren Einhaltung weitergegeben werden. Die Spei...

متن کامل

Computation of Best One - Sided Lx Approximation

A computational procedure based on linear programming is presented for finding the best one-sided Li approximation to a given function. A theorem which ensures that the computational procedure yields approximations which converge to the best approximation is proved. Some numerical examples are discussed.

متن کامل

Discrete linear Chebyshev approximation

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

متن کامل

The Calculation of Best Linear One - Sided LP Approximations

The calculation of linear one-sided approximations is considered, using the discrete Lv norm. For p = 1 and p = <», this gives rise to a linear programming problem, and for 1 < p < »,toa convex programming problem. Numerical results are presented, including some applications to the approximate numerical solution of ordinary differential equations, with error bounds.

متن کامل

Best one-sided approximation of polynomials under L1 norm

In this paper, we develop an analytic solution for the best one-sided approximation of polynomials under L1 norm, that is, we 0nd two polynomials with lower degree which bound the given polynomial such that the areas between the bounding polynomials and the given polynomial attain minimum. The key ingredient of our technique is a characterization for one-sided approximations based on orthogonal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1973

ISSN: 0021-9045

DOI: 10.1016/0021-9045(73)90051-8